-
1 B-tree
Balanced Tree — сбалансированное дерево ( в котором все маршруты от корни к листу имеют одинаковую длину)В-дерево (1. balanced – симметричное ; 2. binary – двоичное)В-дерево; би-дерево (сбалансированное дерево поиска со многими ветвями, в котором степень корневого узла не меньше 2, каждый лист имеет один и тот же уровень)Англо-русский словарь промышленной и научной лексики > B-tree
-
2 сбалансированное бинарное дерево
Information technology: balanced binary treeУниверсальный русско-английский словарь > сбалансированное бинарное дерево
-
3 сбалансированное двоичное дерево
Information technology: balanced binary treeУниверсальный русско-английский словарь > сбалансированное двоичное дерево
-
4 древовидная сортировка
1. tree-selection sort2. tree-structure sort3. Xmas-tree sortРусско-английский большой базовый словарь > древовидная сортировка
См. также в других словарях:
Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… … Wikipedia
Binary Tree — Arbre B Schéma définissant un arbre B. Un arbre B (appelé aussi B arbre par analogie au terme anglais « B tree ») est un arbre équilibré qui est principalement mis en œuvre dans les mécanismes de gestion de bases de données et de… … Wikipédia en Français
Tree traversal — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional … Wikipedia
Tree rotation — A tree rotation is an operation on a binary search tree that changes the structure without interfering with the order of the elements. A tree rotation moves one node up in the tree and one node down. They are used to change the shape of the tree … Wikipedia
Binary logarithm — NOTOC In mathematics, the binary logarithm (log2 n ) is the logarithm for base 2. It is the inverse function of n mapsto 2^n. The binary logarithm is often used in computer science and information theory (where it is frequently written lg n , or… … Wikipedia
Segment tree — In computer science, a segment tree is a tree data structure for storing intervals, or segments. It allows querying which of the stored segments contain a given point. It is, in principle, a static structure; that is, its content cannot be… … Wikipedia
Weight-balanced tree — A weight balanced binary tree is a binary tree where the most probable item is the root item. The left subtree consists of items less than the root items ranking, not its probability. The right sub tree consists of items greater than the root… … Wikipedia
Binary space partitioning — (BSP) is a method for recursively subdividing a space into convex sets by hyperplanes. This subdivision gives rise to a representation of the scene by means of a tree data structure known as a BSP tree.In simpler words, it is a method of breaking … Wikipedia
Scapegoat tree — In computer science, a scapegoat tree is a self balancing binary search tree, invented by Igal Galperin and Ronald L. Rivest. It provides worst case O(log n ) lookup time, and O(log n ) amortized insertion and deletion time.Unlike other self… … Wikipedia
Self-balancing binary search tree — In computer science, a self balancing binary search tree or height balanced binary search tree is a binary search tree that attempts to keep its height , or the number of levels of nodes beneath the root, as small as possible at all times,… … Wikipedia
Red-black tree — A red black tree is a type of self balancing binary search tree, a data structure used in computer science, typically used to implement associative arrays. The original structure was invented in 1972 by Rudolf Bayer who called them symmetric… … Wikipedia